New Strong Converse for Asymmetric Broadcast Channels
نویسنده
چکیده
We consider the discrete memoryless asymmetric broadcast channels. We prove that the error probability of decoding tends to one exponentially for rates outside the capacity region and derive an explicit lower bound of this exponent function. We shall demonstrate that the information spectrum approach is quite useful for investigating this problem.
منابع مشابه
On converse bounds for classical communication over quantum channels
We explore several new converse bounds for classical communication over quantum channels in both the one-shot and asymptotic regime. First, we show that the MatthewsWehner meta-converse bound for entanglement-assisted classical communication can be achieved by activated, no-signalling assisted codes, suitably generalizing a result for classical channels. Second, we derive a new efficiently comp...
متن کاملCoding Theorem and Strong Converse for Quantum Channels
In this correspondence, we present a new proof of Holevo’s coding theorem for transmitting classical information through quantum channels, and its strong converse. The technique is largely inspired by Wolfowitz’s combinatorial approach using types of sequences. As a byproduct of our approach which is independent of previous ones, both in the coding theorem and the converse, we can give a new pr...
متن کامل"Pretty Strong" Converse for the Quantum Capacity of Degradable Channels
We exhibit a possible road towards a strong converse for the quantum capacity of degradable channels. In particular, we show that all degradable channels obey what we call a “pretty strong” converse: When the code rate increases above the quantum capacity, the fidelity makes a discontinuous jump from 1 to at most 1 √ 2 , asymptotically. A similar result can be shown for the private (classical) ...
متن کاملA Coding Problem via Quantum Channels
Hoa Tran, Fordham University In Quantum Communication Channels, identification via quantum channels in which the transmission capacity is in soft converse. The new approach for quantum channels based on strong converse method will be addressed, it involves a development of explicit large deviation estimates to the case of random variables taking values in self-adjoint operators.
متن کاملNoisy Broadcast Networks with Receiver Caching
We study noisy broadcast networks with local cache memories at the receivers, where the transmitter can pre-store information even before learning the receivers’ requests. We mostly focus on packet-erasure broadcast networks with two disjoint sets of receivers: a set of weak receivers with all-equal erasure probabilities and equal cache sizes and a set of strong receivers with all-equal erasure...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1604.02901 شماره
صفحات -
تاریخ انتشار 2016